Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply-Add Instructions
نویسنده
چکیده
We present a new formulation of fast Fourier transformation (FFT) kernels for radix 2, 3, 4, and 5, which have a perfect balance of multiplies and adds. These kernels give higher performance on machines that have a single multiply–add (mult–add) instruction. We demonstrate the superiority of this new kernel on IBM and SGI workstations. Key word. FFT kernels AMS subject classifications. 65-04, 42-04 PII. S1064827595281940
منابع مشابه
Multiply - Add Optimized Fft Kernels
Modern computer architecture provides a special instruction|the fused multiply-add (FMA) instruction|to perform both a multiplication and an addition operation at the same time. In this paper newly developed radix-2, radix-3, and radix-5 FFT kernels that e ciently take advantage of this powerful instruction are presented. If a processor is provided with FMA instructions, the radix-2 FFT algorit...
متن کاملA radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method
A radix-16 fast Fourier transform (FFT) algorithm suitable for multiply-add instruction is proposed. The proposed radix-16 FFT algorithm requires fewer floating-point instructions than the conventional radix-16 FFT algorithm on processors that have a multiplyadd instruction. Moreover, this algorithm has the advantage of fewer loads and stores than either the radix-2, 4 and 8 FFT algorithms or t...
متن کاملRadix-4 FFT implementation using SIMD multimedia instructions
In this paper, a fast radix-4 complex FFT implementation using 4-parallel SIMD instructions is presented. Four radix-4 butterflies are calculated in parallel at all stages by loading consecutive 4 elements into a register. At the last stage, every 4 elements is packed into a register and calculated in parallel. This regular data flow enables higher parallelism and an overhead reduction in data ...
متن کاملParallel FFT Implementations on Fixed-Point DSP-Cores with Subword-Parallelism
Fast Fourier transform algorithms are vital in many digital signalprocessing (DSP) applications. In here, both, radix-2 and radix-4 complex fast Fourier transform (FFT) implementations for fixed-point applications, using single instruction multiple data (SIMD) instructions and sub-word parallelism (SWP) is presented. It is shown that data management, and memory access are key to unleashing the ...
متن کاملA New Fast Discrete Fourier Transform
This paper presents a new fast Discrete Fourier Transform (DFT) algorithm. By rewriting the DFT, a new algorithm is obtained that uses 2 n?2 (3n?13)+4n?2 real multiplications and 2 n?2 (7n? 29) + 6n + 2 real additions for a real data N = 2 n point DFT, comparable to the number of operations in the Split-Radix method, but with slightly fewer multiply and add operations in total. Because of the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 18 شماره
صفحات -
تاریخ انتشار 1997